A point calculus for interlevel set homology
نویسندگان
چکیده
منابع مشابه
A point calculus for interlevel set homology
The theory of persistent homology opens up the possibility to reason about topological features of a space or a function quantitatively and in combinatorial terms. We refer to this new angle at a classical subject within algebraic topology as a point calculus, which we present for the family of interlevel sets of a real-valued function. Our account of the subject is expository, devoid of proofs...
متن کاملHomology and Robustness of Level and Interlevel Sets
Given a function f : X → R on a topological space, we consider the preimages of intervals and their homology groups and show how to read the ranks of these groups from the extended persistence diagram of f . In addition, we quantify the robustness of the homology classes under perturbations of f using well groups. After characterizing these groups, we show how to read their ranks from the same ...
متن کاملA Calculus for Bordered Floer Homology
We consider a class of manifolds with torus boundary admitting bordered Heegaard Floer homology of a particularly simple form, namely, the type D structure may be described graphically by a disjoint union of loops. We develop a calculus for studying bordered invariants of this form and, in particular, provide a complete description of slopes giving rise to L-space Dehn fillings as well as neces...
متن کاملA fixed point result for a new class of set-valued contractions
In this paper, we introduce a new class of set-valued contractions and obtain a xed point theoremfor such mappings in complete metric spaces. Our main result generalizes and improves many well-known xed point theorems in the literature.
متن کاملEfficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 2012
ISSN: 0167-8655
DOI: 10.1016/j.patrec.2011.10.007